Matroid theory

Results: 338



#Item
131Discrete mathematics / Matroid / Submodular set function / Greedy algorithm / Greedoid / Weighted matroid / Matroid theory / Mathematics / Combinatorics

Maximum Coverage over a Matroid Constraint Yuval Filmus Justin Ward University of Toronto China Theory Week 2011

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2011-10-18 11:48:40
132Dense graph / Adjacency matrix / Matroid theory / Calculus / Graph theory / Mathematics / Graph

arXiv:1408.0744v1 [math.CO] 4 AugAN Lp THEORY OF SPARSE GRAPH CONVERGENCE II: LD CONVERGENCE, QUOTIENTS, AND RIGHT CONVERGENCE CHRISTIAN BORGS, JENNIFER T. CHAYES, HENRY COHN, AND YUFEI ZHAO

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2014-08-04 20:27:04
133Mathematical optimization / Submodular set function / Operations research / Convex optimization / Matroid / Linear programming / Greedy algorithm / Algorithm / Greedoid / Mathematics / Matroid theory / Combinatorics

Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search Yuval Filmus∗ and Justin Ward† December 30, 2013 Abstract

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2013-12-30 15:39:21
134Finite fields / Computational geometry / Matroid theory / Tutte polynomial / Factorization of polynomials over a finite field and irreducibility tests / Mathematics / Polynomials / Elliptic curves

Approximating the average stretch factor of geometric graphs∗ Siu-Wing Cheng† Christian Knauer‡ Stefan Langerman§ Michiel Smid¶ Abstract Let G be a geometric graph whose vertex set S is a set of n points in Rd .

Add to Reading List

Source URL: www.cs.ust.hk

Language: English - Date: 2011-01-03 00:53:54
135Stochastic processes / Random walk / Minimum spanning tree / Planar graph / Random geometric graph / Graph / Normal distribution / Combinatorics / Matroid theory / Graph theory / Mathematics / Random graphs

20th International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms AOFA’09 June,

Add to Reading List

Source URL: aofa2009.greyc.fr

Language: English - Date: 2009-06-15 08:15:19
136Connectivity / Representation / Graph / Cayley graph / Path decomposition / Universal graph / Graph theory / Mathematics / Matroid theory

Lower Bounds for (Weak) Sense of Direction Paolo Boldi∗ Sebastiano Vigna∗ Abstract

Add to Reading List

Source URL: vigna.di.unimi.it

Language: English - Date: 2002-05-18 04:50:44
137NP-complete problems / Matroid theory / Operations research / Submodular set function / Matroid / Greedy algorithm / Set cover problem / Linear programming / Algorithm / Mathematics / Theoretical computer science / Applied mathematics

The Power of Local Search: Maximum Coverage over a Matroid Yuval Filmus1,2 and Justin Ward1 1 2

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2011-12-02 06:14:39
138Submodular set function / Order theory / Matroid / Linear programming / Greedy algorithm / XTR / Monotonic function / Greedoid / Ordinal optimization / Mathematics / Mathematical analysis / Matroid theory

Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search Yuval Filmus and Justin Ward November 25, 2012 Abstract We present an optimal, combinatorial 1 − 1/e approximation algorithm for monotone s

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2012-11-25 12:04:59
139Greedy algorithm / Matroid theory / Routing / Topology / Connectivity / Network topology / Routing algorithms / Network theory / Small world routing / Mathematics / Combinatorics / Network architecture

1 Increasing Network Resiliency by Optimally Assigning Diverse Variants to Routing Nodes Andrew Newell1 , Daniel Obenshain2 , Thomas Tantillo2 , Cristina Nita-Rotaru1 , and Yair Amir2 1 Department of Computer Science, P

Add to Reading List

Source URL: www.cnds.jhu.edu

Language: English - Date: 2014-08-28 10:26:44
140Matroid / Randomized rounding / Auxiliary function / Euclidean algorithm / Dominating set / Mathematics / Submodular set function / Matroid theory

A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint Yuval Filmus Department of Computer Science University of Toronto

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2012-08-16 03:01:30
UPDATE